The Expressive Power of Partial Models in Disjunctive Deductive Databases
نویسندگان
چکیده
منابع مشابه
Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases 1
This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undeened stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is dete...
متن کاملExpressive Power and Complexity of Partial Models for Disjunctive Deductive Databases
This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undeened stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is dete...
متن کاملPartial Evidential Stable Models for Disjunctive Deductive Databases
In this paper we consider the basic semantics of stable and partial stable models for disjunctive deductive databases (with default negation), cf. [9,16]. It is well–known that there are disjunctive deductive databases where no stable or partial stable models exist, and these databases are called inconsistent w.r.t. the basic semantics. We define a consistent variant of each class of models, wh...
متن کاملMinimal founded semantics for disjunctive logic programs and deductive databases
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model ...
متن کاملA Characterization of the Partial Stable Models for Disjunctive Deductive Databases
We give a characterization of the partial stable models of a disjunctive deductive database P in terms of the total stable models of a suitably transformed database P tu. The transformation is based on annotating the atoms in the given database by the truth values true (\t") and undeened (\u"). Currently many fast algorithms are being developed for computing the total stable models of disjuncti...
متن کامل